The time to read the input and initialise the problem = 313 ms
The time to create the LP bound problem = 15 ms
The time to compute the linear programming bound = 94 ms
The linear programming lower bound on the solution is:
x11=0.000000
x12=0.004638
x13=0.995362
x14=0.000000
x15=0.000000
x21=0.000000
x22=0.000000
x23=1.000000
x24=0.000000
x25=0.000000
x31=0.000000
x32=0.000000
x33=0.000000
x34=1.000000
x35=0.000000
x41=0.948980
x42=0.051020
x43=0.000000
x44=0.000000
x45=0.000000
x51=0.000000
x52=0.051020
x53=0.948980
x54=0.000000
x55=0.000000
x61=0.000000
x62=0.000000
x63=0.000000
x64=0.000000
x65=1.000000
x71=0.714286
x72=0.000000
x73=0.000000
x74=0.190476
x75=0.095238
x81=0.374830
x82=0.051020
x83=0.574150
x84=0.000000
x85=0.000000
x91=0.000000
x92=0.000000
x93=0.000000
x94=1.000000
x95=0.000000
x101=0.948980
x102=0.051020
x103=0.000000
x104=0.000000
x105=0.000000
y1=1.000000
y2=0.051020
y3=1.000000
y4=1.000000
y5=1.000000
z1=0.255977
z2=0.000000
z3=0.000000
w11=68.000000
w12=5.000000
w13=68.000000
w14=26.000000
w15=15.000000
w21=0.000000
w22=0.000000
w23=0.000000
w24=0.000000
w25=0.000000
w31=0.000000
w32=0.000000
w33=0.000000
w34=0.000000
w35=0.000000
z=52397.638176
The time to read the LP bound solution = 0 ms
Run time is 1422 ms
